Discovering Frequent Patterns to Bootstrap Trust

نویسندگان

  • Murat Sensoy
  • Burcu Yilmaz
  • Timothy J. Norman
چکیده

When a new agent enters to an open multiagent system, bootstrapping its trust becomes a challenge because of the lack of any direct or reputational evidence. To get around this problem, existing approaches assume the same a priori trust for all newcomers. However, assuming the same a priori trust for all agents may lead to other problems like whitewashing. In this paper, we leverage graph mining and knowledge representation to estimate a priori trust for agents. For this purpose, our approach first discovers significant patterns that may be used to characterise trustworthy and untrustworthy agents. Then, these patterns are used as features to train a regression model to estimate trustworthiness. Lastly, a priori trust for newcomers are estimated using the discovered features based on the trained model. Through extensive simulations, we have showed that the proposed approach significantly outperforms existing approaches.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incremental Mining for Frequent Patterns in Evolving Time Series Datatabases

Several emerging applications warrant mining and discovering hidden frequent patterns in time series databases, e.g., sensor networks, environment monitoring, and inventory stock monitoring. Time series databases are characterized by two features: (1) The continuous arrival of data and (2) the time dimension. These features raise new challenges for data mining such as the need for online proces...

متن کامل

Discovering Frequent Tree Patterns over Data Streams

Since tree-structured data such as XML files are widely used for data representation and exchange on the Internet, discovering frequent tree patterns over tree-structured data streams becomes an interesting issue. In this paper, we propose an online algorithm to continuously discover the current set of frequent tree patterns from the data stream. A novel and efficient technique is introduced to...

متن کامل

Non-Derivable Item Set and Non-Derivable Literal Set Representations of Patterns Admitting Negation

The discovery of frequent patterns has attracted a lot of attention of the data mining community. While an extensive research has been carried out for discovering positive patterns, little has been offered for discovering patterns with negation. The main hindrance to the progress of such research is huge amount of frequent patterns with negation, which exceeds the number of frequent positive pa...

متن کامل

Discovering partial periodic-frequent patterns in a transactional database

Time and frequency are two important dimensions to determine the interestingness of a pattern in a database. Periodic-frequent patterns are an important class of regularities that exist in a database with respect to these two dimensions. Current studies on periodic-frequent pattern mining have focused on discovering full periodic-frequent patterns, i.e., finding all frequent patterns that have ...

متن کامل

MINING FUZZY TEMPORAL ITEMSETS WITHIN VARIOUS TIME INTERVALS IN QUANTITATIVE DATASETS

This research aims at proposing a new method for discovering frequent temporal itemsets in continuous subsets of a dataset with quantitative transactions. It is important to note that although these temporal itemsets may have relatively high textit{support} or occurrence within particular time intervals, they do not necessarily get similar textit{support} across the whole dataset, which makes i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012